#include<unordered_map>
#include<vector>
using namespace std;

vector<int> twoSum(vector<int>& nums, int target) {
    unordered_map<int, int> Mymap;
    for (int i = 0; i < nums.size(); ++i) {
        int complement = target - nums[i];
        if (Mymap.find(complement) != Mymap.end()) {
            return {Mymap[complement], i};
        }
        Mymap[nums[i]] = i;
    }
    return {};
}

int main() {
    
}